A study of nested-relational joins in mediator-based distributed environments
نویسنده
چکیده
This thesis reports on the results of a study of the nested join operator in a mediator-based setting. As the rate at which data is accumulated increases, the need for integration of di erent (physical) Database Management Systems (DBMS) becomes apparent. The most fundamental and arguably important operation that is used in order to achieve this is the join-operator. The nested-relational model is a exible data model and can be used to describe data on practically all de facto data models such as relational, object-relational and XML-based DBMS. Although joins are not new, very little work has been done in the area of the nested-relational join operator. Some authors [15, 18, 19] have proposed nested relational join operators, however an implementation has not been reported. Information systems companies in their IT-landscape are often of a di erent make. This leads to di culties concerning data integration. To solve these di culties in an e cient way a mediation service, also known as a mediator, is introduced to their IT-landscape. The mediator facilitates communication between di erent databases and the end-user. The focus of this study is the design, implemention and evaluation of a nestedrelational join operator in a mediator-based context. This study presents a generalized version of the join introduced by Garani & Johnson [15]. This generalized join is implemented in a mediator-based context, which poses some additional constraints on the implementation. Subsequently the implementation is evaluated and the results are presented.
منابع مشابه
Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases
Previous work on functional joins was constrained in two ways: (1) all approaches we know assume references being implemented as physical object identifiers (OIDs) and (2) most approaches are, in addition, limited to single-valued reference attributes. Both are severe limitations since most object-relational and all object-oriented database systems do support nested reference sets and many obje...
متن کاملThe Complete Story of Joins (in HyPer)
SQL has evolved into an (almost) fully orthogonal query language that allows (arbitrarily deeply) nested subqueries in nearly all parts of the query. In order to avoid recursive evaluation strategies which incur unbearable O(n2) runtime we need an extended relational algebra to translate such subqueries into non-standard join operators. This paper concentrates on the non-standard join operators...
متن کاملMetadata Enrichment for Automatic Data Entry Based on Relational Data Models
The idea of automatic generation of data entry forms based on data relational models is a common and known idea that has been discussed day by day more than before according to the popularity of agile methods in software development accompanying development of programming tools. One of the requirements of the automation methods, whether in commercial products or the relevant research projects, ...
متن کاملCompiling Away Set Containment and Intersection Joins
We investigate the effect of query rewriting on joins involving set-valued attributes in object-relational database management systems. We show that by unnesting set-valued attributes (that are stored in an internal nested representation) prior to the actual set containment or intersection join we can improve the performance of query evaluation by an order of magnitude. By giving example query ...
متن کاملEfficient Evaluation of the Valid-Time Natural Join
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the optimization of joins with equality predicates, rather than the inequality predicates prevalent in valid-time queries. Seco...
متن کامل